- polynomial number
- Вычислительная техника: алгебраическое число
Универсальный англо-русский словарь. Академик.ру. 2011.
Универсальный англо-русский словарь. Академик.ру. 2011.
Polynomial function theorems for zeros — are a set of theorems aiming to find (or determine the nature) of the complex zeros of a polynomial function.Found in most precalculus textbooks, these theorems include: * Remainder theorem * Factor theorem * Descartes rule of signs * Rational… … Wikipedia
Polynomial conjoint measurement — is an extension of the theory of conjoint measurement to three or more attributes. It was initially developed by the mathematical psychologists David Krantz (1968) and Amos Tversky (1967). The theory was given a comprehensive mathematical… … Wikipedia
Polynomial — In mathematics, a polynomial (from Greek poly, many and medieval Latin binomium, binomial [1] [2] [3], the word has been introduced, in Latin, by Franciscus Vieta[4]) is an expression of finite length constructed from variables (also known as… … Wikipedia
Polynomial factorization — In mathematics and computer algebra, polynomial factorization typically refers to factoring a polynomial into irreducible polynomials over a given field. Formulation of the questionOther factorizations, such as square free factorization exist,… … Wikipedia
Number — For other uses, see Numbers (disambiguation). A number is a mathematical object used to count and measure. In mathematics, the definition of number has been extended over the years to include such numbers as zero, negative numbers, rational… … Wikipedia
Polynomial interpolation — In the mathematical subfield of numerical analysis, polynomial interpolation is the interpolation of a given data set by a polynomial. In other words, given some data points (such as obtained by sampling), the aim is to find a polynomial which… … Wikipedia
Polynomial basis — In mathematics, the polynomial basis is a basis for finite extensions of finite fields.Let α ∈ GF( p m ) be the root of a primitive polynomial of degree m over GF( p ). The polynomial basis of GF( p m ) is then:{ 0, 1, alpha, ldots, alpha^{m… … Wikipedia
Number theory — A Lehmer sieve an analog computer once used for finding primes and solving simple diophantine equations. Number theory is a branch of pure mathematics devoted primarily to the study of the integers. Number theorists study prime numbers (the… … Wikipedia
Polynomial and rational function modeling — In statistical modeling (especially process modeling), polynomial functions and rational functions are sometimes used as an empirical technique for curve fitting.Polynomial function modelsA polynomial function is one that has the form:y = a… … Wikipedia
Polynomial long division — In algebra, polynomial long division is an algorithm for dividing a polynomial by another polynomial of the same or lower degree, a generalised version of the familiar arithmetic technique called long division. It can be done easily by hand,… … Wikipedia
Polynomial expression — In mathematics, and in particular in the field of algebra, a polynomial expression in one or more given entities E 1, E 2, ..., is any meaningful expression constructed from copies of those entities together with (usually numeric) constants,… … Wikipedia